#include <sys/types.h> #include <sys/dir.h> int scandir(name, list, selector, sorter) char *name; struct direct ***list; int (*selector)(); int (*sorter)(); int alphasort(d1, d2) struct direct **d1; struct direct **d2;
If the selector parameter is non-NULL, it is taken to be a pointer to a function called with each entry, to determine whether or not it should be included in the returned list. If the parameter is NULL, all entries are included.
As an added feature, the entries can be sorted (with qsort(3)) before the list is returned. If the sorter parameter is non-NULL, it is passed to qsort to use as the comparison function. The alphasort routine is provided to sort the array alphabetically.
The array pointed to by list and the items it points to are all space obtained through malloc(3), and their storage can be reclaimed as shown in the example below.
#include <stdio.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <sys/dir.h>
extern int alphasort();
static int
filesonly(e)
struct direct *e;
{
struct stat sb;
return(stat(e->d_name, &sb) >= 0 && (sb.st_mode & S_IFMT) == S_IFREG);
}
main(ac, av)
int ac;
char *av[];
{
register int i;
register int j;
struct direct **list;
if (ac != 2) {
fprintf(stderr, "usage: %s dirname, av[0]);
exit(1);
}
if (chdir(av[1]) < 0) {
perror(av[1]);
exit(1);
}
if ((i = scandir(".", &list, filesonly, alphasort)) < 0) {
perror("Error reading directory");
exit(1);
}
for (j = 0; j < i; j++)
printf("%s, list[j]->d_name);
for (j = 0; j < i; j++)
free((char *)list[j]);
free((char *)list);
exit(0);
}